منابع مشابه
Quasiperiodicity and String Covering
In this paper, we study word regularities and in particular extensions of the notion of the word period: quasiperiodicity, covers and seeds. We present overviews of algorithms for computing the quasiperiodicity, the covers and the seeds of a given word. We also present an overview of an algorithm that finds maximal word factors with the above regularities. Finally, we show how Fine and Wilf’s T...
متن کاملCovers in 5-uniform intersecting families with covering number three
Let k be an integer. It is known that the maximum number of threecovers of a k-uniform intersecting family with covering number three is k − 3k + 6k − 4 for k = 3, 4 or k ≥ 9. In this paper, we prove that the same holds for k = 5, and show that a 5-uniform intersecting family with covering number three which has 76 three-covers is uniquely determined.
متن کاملComputing the k-covers of a string
Given a string x of length n and an integer constant k, the k-Cover Problem is defined to be the identification of all the sets of k substrings each of equal length that cover x. This problem can be solved by a general algorithm in OðnÞ time for constant alphabet size. We also generalize the k-Cover Problem, whereby a set of k substrings of different lengths are considered, which can be compute...
متن کاملAn Optimal Algorithm to Compute all the Covers of a String
Let x denote a given nonempty string of length n jxj A string u is a cover of x if and only if every position of x lies within an occurrence of u within x Thus x is always a cover of itself In this paper we characterize all the covers of x in terms of an easily computed normal form for x The characterization theorem then gives rise to a simple recursive algorithm which computes all the covers o...
متن کاملA Correction to "An Optimal Algorithm to Compute all the Covers of a String"
This note corrects an error in a paper recently published in this journal (An optimal algorithm to compute all the covers of a string, IPL 50-5 (1994) 239-246). The correction consists primarily of a new subalgorithm which is called by COMPUTE COVERS, the main algorithm presented in the paper referenced. It turns out that the new subalgorithm is itself suucient to solve the original problem | t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Discrete Algorithms
سال: 2018
ISSN: 1570-8667
DOI: 10.1016/j.jda.2018.09.003